The Hamiltonian index of graphs
نویسندگان
چکیده
The Hamiltonian index ofa graph G is defined as h(G) = minim: LIIl(G) is Hamiltonian). In this paper, using the reduction method of Catlin [P.A. Catlin, A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12 (1988) 29-44], we constructed a graph i/(m)(G) from G and prove that ifh(G)?:. 2, then h(G) = minim : i/(m)(G) has a spanning Eulerian subgraphl.
منابع مشابه
Geometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملOn distance local connectivity and the hamiltonian index
In this paper, the concept of distance local connectivity of a graph is presented. Several results involving the independence number of graphs and degree conditions for distance local connectivity of graphs are proved. The relations between distance local connectivity of graphs and the hamiltonian index of graphs are given.
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملCentrality of Some Cubic Graphs on 16 Vertices
There exist graphs of which all detours are Hamiltonian paths. Such graphs are called by Diudea (J. Chem. Inf. Comput. Sci. 1997, 37, 1101-1108) full Hamiltonian detour FHΔ graphs. These graphs show the maximal value of the Detour index while the minimal value of the Cluj-Detour index. A selected set of cubic graphs on 16 vertices is tested for the distribution of the relative centrality RC val...
متن کاملAbout the catalog of (3, g) Hamiltonian bipartite graphs
A catalog of a class of (3, g) graphs for even girth g is introduced in this paper. A (k, g) graph is a graph with regular degree k and girth g. This catalog of (3, g) graphs for even girth g satisfying 6 ≤ g ≤ 16, has the following properties. Firstly, this catalog contains the smallest known (3, g) graphs. An appropriate class of trivalent graphs for this catalog has been identified, such tha...
متن کاملEffects of asymmetric stiffness on parametric instabilities of rotor
This work deals with effects of asymmetric stiffness on the dynamic behaviour of the rotor system. The analysis is presented through an extended Lagrangian Hamiltonian mechanics on the asymmetric rotor system, where symmetries are broken in terms of the rotor stiffness. The complete dynamics of asymmetries of rotor system is investigated with a case study. In this work, a mathematical model is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009